DFS 및 BFS PAT A급 A1155 힙 패스(30점) In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or les... PAT A급차례로 돌아가다쌓다DFS 및 BFS 로곡 P1434 [SHOI2002] 스키(DP, 기억화 검색) d p [ i ] [ j ] = m a x ( d p [ i + 1 ] [ j ] + 1 , d p [ i ] [ j ] ( i f d p [ i ] [ j ] > d p [ i + 1 ] [ j ] ) dp[i][j]=max(dp[i+1][j]+1,dp[i][j]\\(if\dp[i][j]>dp[i+1][j]) dp[i][j]=max(dp[i+1][j]+1,dp[i][j] (if ... 낙곡DFS 및 BFSDP
PAT A급 A1155 힙 패스(30점) In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or les... PAT A급차례로 돌아가다쌓다DFS 및 BFS 로곡 P1434 [SHOI2002] 스키(DP, 기억화 검색) d p [ i ] [ j ] = m a x ( d p [ i + 1 ] [ j ] + 1 , d p [ i ] [ j ] ( i f d p [ i ] [ j ] > d p [ i + 1 ] [ j ] ) dp[i][j]=max(dp[i+1][j]+1,dp[i][j]\\(if\dp[i][j]>dp[i+1][j]) dp[i][j]=max(dp[i+1][j]+1,dp[i][j] (if ... 낙곡DFS 및 BFSDP